import java.util.*;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.IOException;

// 牛客网BC145 笨小猴
 class Solution1 {
    public static void main(String[] args) throws IOException{
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        String s = reader.readLine();
        char[] ch = s.toCharArray();
        int maxN = 0;
        int minN = Integer.MAX_VALUE;
        int[] temp = new int[26];
        for(int i = 0; i < ch.length; i++) {
            temp[ch[i] - 'a']++;
        }
        for(int i = 0; i < 26; i++) {
            if(temp[i] == 0) {
                continue;
            }
            maxN = Math.max(maxN, temp[i]); // 找到最大值
            minN = Math.min(minN, temp[i]); // 找到最小值
        }

        int num = maxN - minN; // 差值
        if(isPrime(num)) {
            System.out.println("Lucky Word");
            System.out.println(num);
        }else{
            System.out.println("No Answer");
            System.out.println(0);
        }
    }
    public static boolean isPrime(int num) {
        if(num <= 1) return false;
        if(num == 2) return true;
        if(num % 2 == 0) return false;
        for(int i = 3; i <= Math.sqrt(num); i++) {
            if (num % i == 0) {
                return false;
            }
        }
        return true;
    }
}



// 牛客网NC383 主持人调度（一）
public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     *
     * @param schedule int整型二维数组 
     * @return bool布尔型
     */
    public boolean hostschedule (ArrayList<ArrayList<Integer>> schedule) {
        int[][] arr = new int[schedule.size()][schedule.get(0).size()];
        for(int i = 0; i < schedule.size(); i++) {
            for(int j = 0; j < schedule.get(0).size(); j++) {
                arr[i][j] = schedule.get(i).get(j);
            }
        }
        Arrays.sort(arr, (a, b) -> {
            return a[0] - b[0];
        });
        for(int i = 1; i < schedule.size(); i++) {
            if(arr[i][0] < arr[i-1][1]) {
                return false;
            }
        }
        return true;
    }
}




// 牛客网DP45 分割等和子集
 class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt(); // nums的长度
        int[] nums = new int[n];
        int sum = 0; // nums数组的和
        for(int i = 0; i < n; i++) {
            nums[i] = in.nextInt(); // nums数组
            sum += nums[i];
        }
        if(sum % 2 == 1) {
            System.out.print("false");
            return;
        }
        int target = sum / 2;
        boolean[] dp = new boolean[target + 1];
        dp[0] = true;

        for (int num : nums) {
            for (int j = target; j >= num; j--) {
                dp[j] = dp[j] || dp[j - num];
            }
        }
        System.out.println("true");

    }
}